Hybrid Local Search Polynomial-Expanded Linear Multiuser Detector for SIMO DS/CDMA Systems

In this work, low-complexity suboptimum detectors have been analyzed for a single-input multiple-output (SIMO) direct-sequence code division multiple access (DS/CDMA) system. As a contribution, a hybrid multiuser detector based on polynomial expansion (PE-MuD) with alpha-estimation determined by Gerschgorin circles Theorem (GCT), and followed by a lowcomplexity local search procedure is proposed for synchronous SIMO DS/CDMA systems. The computational complexity of the PE-MuD and the LS-MuDs are expressed in terms of the total number of floating point operations in order to converge. Herein, the spatial diversity is exploited in order to improve the performance of the low-complexity multiuser detectors. Keywords—Near-optimum search algorithms, polynomialexpanded multiuser detection, Gerschgorin circles, SIMO DS/CDMA.